205 research outputs found

    Lifetimes of C-60(2-) and C-70(2-) dianions in a storage ring

    Get PDF
    C-60(2-) and C-70(2-) dianions have been produced by electrospray of the monoanions and subsequent electron pickup in a Na vapor cell. The dianions were stored in an electrostatic ring and their decay by electron emission was measured up to 1 s after injection. While C-70(2-) ions are stable on this time scale, except for a small fraction of the ions which have been excited by gas collisions, most of the C-60(2-) ions decay on a millisecond time scale, with a lifetime depending strongly on their internal temperature. The results can be modeled as decay by electron tunneling through a Coulomb barrier, mainly from thermally populated triplet states about 120 meV above a singlet ground state. At times longer than about 100 ms, the absorption of blackbody radiation plays an important role for the decay of initially cold ions. The tunneling rates obtained from the modeling, combined with WKB estimates of the barrier penetration, give a ground-state energy 200 +/- 30 meV above the energy of the monoanion plus a free electron and a ground-state lifetime of the order of 20 s. (c) 2006 American Institute of Physics

    X-ray image reconstruction from a diffraction pattern alone

    Full text link
    A solution to the inversion problem of scattering would offer aberration-free diffraction-limited 3D images without the resolution and depth-of-field limitations of lens-based tomographic systems. Powerful algorithms are increasingly being used to act as lenses to form such images. Current image reconstruction methods, however, require the knowledge of the shape of the object and the low spatial frequencies unavoidably lost in experiments. Diffractive imaging has thus previously been used to increase the resolution of images obtained by other means. We demonstrate experimentally here a new inversion method, which reconstructs the image of the object without the need for any such prior knowledge.Comment: 5 pages, 3 figures, improved figures and captions, changed titl

    Constructive pointfree topology eliminates non-constructive representation theorems from Riesz space theory

    Get PDF
    In Riesz space theory it is good practice to avoid representation theorems which depend on the axiom of choice. Here we present a general methodology to do this using pointfree topology. To illustrate the technique we show that almost f-algebras are commutative. The proof is obtained relatively straightforward from the proof by Buskes and van Rooij by using the pointfree Stone-Yosida representation theorem by Coquand and Spitters

    Log Analysis for Data Protection Accountability

    Get PDF
    International audienceAccountability is increasingly recognised as a cornerstone of data protection, notably in European regulation, but the term is frequently used in a vague sense. For accountability to bring tangible benefits, the expected properties of personal data handling logs (used as "accounts") and the assumptions regarding the logging process must be defined with accuracy. In this paper, we provide a formal framework for accountability and show the correctness of the log analysis with respect to abstract traces used to specify privacy policies. We also show that compliance with respect to data protection policies can be checked based on logs free of personal data, and describe the integration of our formal framework in a global accountability process

    An algorithmic approach to the existence of ideal objects in commutative algebra

    Full text link
    The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a constructive meaning to ideal objects is a problem which dates back to Hilbert's program, and today is still a central theme in the area of dynamical algebra, which focuses on the elimination of ideal objects via syntactic methods. In this paper, we take an alternative approach based on Kreisel's no counterexample interpretation and sequential algorithms. We first give a computational interpretation to an abstract maximality principle in the countable setting via an intuitive, state based algorithm. We then carry out a concrete case study, in which we give an algorithmic account of the result that in any commutative ring, the intersection of all prime ideals is contained in its nilradical

    Automatic Methods for Analyzing Non-repudiation Protocole with an Active Intruder

    Get PDF
    International audienceNon-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. After discussing the limitations of this method, we define a new one based on the handling of the knowledge of protocol participants. This second method is general and of natural use, as it consists in adding simple annotations in the protocol specification. It is very easy to implement in tools able to handle participants knowledge. We have implemented it in the AVISPA Tool and analyzed the optimistic Cederquist-Corin-Dashti protocol, discovering two attacks. This extension of the AVISPA Tool for handling non-repudiation opens a highway to the specification of many other properties, without any more change in the tool itself
    • 

    corecore